Character sums and nonlinear recurrence sequences
نویسندگان
چکیده
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over arbitrary finite rings. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Erratum to "Character sums and nonlinear recurrence sequences": [Discrete Math 306 (2006) 1126-1131]
Unfortunately Theorems 1 and 3 of our recent paper “Character sums and nonlinear recurrence sequences” [1] of this journal do not hold in full generality (though the results do hold over a finite field, which is the main case of interest). This brief note states corrected versions of these theorems. We first remind the reader of the notation used in [1]. Let R be a finite ring of m elements. Le...
متن کاملMultiplicative Character Sums for Nonlinear Recurring Sequences with Dickson Polynomials
We give new bounds of character sums with sequences of iterations of Dickson polynomials over finite fields. This result is motivated by possible applications of nonlinear congruential pseudorandom number generators.
متن کاملMultiplicative Character Sums of Recurring Sequences with Rédei Functions
We prove a new bound for multiplicative character sums of nonlinear recurring sequences with Rédei functions over a finite field of prime order. This result is motivated by earlier results on nonlinear recurring sequences and their application to the distribution of powers and primitive elements. The new bound is much stronger than the bound known for general nonlinear recurring sequences.
متن کاملMultiplicative Character Sums with Counter-Dependent Nonlinear Congruential Pseudorandom Number Generators
Nonlinear congruential pseudorandom number generators can have unexpectedly short periods. Shamir and Tsaban introduced the class of counter-dependent generators which admit much longer periods. In this paper we present a bound for multiplicative character sums for nonlinear sequences generated by counter-dependent generators.
متن کاملCharacter Sums with Division Polynomials
We obtain nontrivial estimates of quadratic character sums of division polynomials Ψn(P ), n = 1, 2, . . ., evaluated at a given point P on an elliptic curve over a finite field of q elements. Our bounds are nontrivial if the order of P is at least q for some fixed ε > 0. This work is motivated by an open question about statistical indistinguishability of some cryptographically relevant sequenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006